Search diversification techniques for grammatical inference

Grammatical Inference (GI) addresses the problem of learning a grammar G, from a finite set of strings generated by G. By using GI techniques we want to be able to learn relations between syntactically structured sequences. This process of inferring the target grammar G can easily be posed as a search problem through a lattice of possible solutions. The vast majority of research being carried out in this area focuses on non-monotonic searches, i.e. use the same heuristic function to perform a depth first search into the lattice until a hypothesis is chosen. EDSM and S-EDSM are prime examples of this technique. In this paper we discuss the introduction of diversification into our search space [5]. By introducing diversification through pairwise incompatible merges, we traverse multiple disjoint paths in the search lattice and obtain better results for the inference process.peer-reviewe

COLLEGE : a collaborative on-line lecture environment for group and individual eLearning

COLLEGE is a platform for the development and delivery of interactive learning content for individual students or groups and will be built during 2005-2007. Phase I will deliver primarily video- and audio-based learning content together with tools to provide automated assistance and assessment of student progress. Phase II will increase the options for the learning content to include non-time-based media and will increase the level of Just- in-Time support for students. The COLLEGE toolset will be based around virtual metaphors corresponding to traditional tools for learning, recording, interacting with the source of the learning material, and assessment.peer-reviewe

Language technology for eLearning

Given the huge amount of static and dynamic contents created for eLearning tasks, the major challenge for their wide use is to improve their retrieval and accessibility within Learning Management Systems. This paper describes the LT4eL project which addresses this challenge by proposing Language Technology based functionalities to support semi-automatic metadata generation for the description of the learning objects, on the basis of a linguistic analysis of the content. Se- mantic knowledge will be integrated to enhance the management, distribution and retrieval of the learning material. We will employ ontologies, key elements in the architecture of the Semantic Web initiative, to structure the learning material within Learning Management Systems, by means of the descriptive metadata. We will also explore the use of Latent Semantic Indexing techniques for the matching of the learning objects with the user information requirements.peer-reviewe

Semantically annotate everything?

Search as we know it will change and improve as new and enhanced methodologies to accommodate the ever expanding semantically annotated World-Wide Web will be developed and fruitfully employed. While a lot of basic infrastructure has already been developed to prepare for the onset of the Semantic Web, like meta-languages, editors, inference engines, and others, other critical developments need to be put in place too. This short paper discusses the issues as well as the best application areas to ’Semantically Annotate Everything’ and transform on a mass scale the wealth of knowledge on the web into information as semantic metadata on the Semantic web.peer-reviewe

A framework for an adaptive virtual learning environment

This paper is actually an adapted M.Sc. proposal. Work on this degree has only just start so there are no results to be presented. However, during the CSAW presentation further details will be given about research problems and how they will be solved.peer-reviewe

Measuring the functionality of online stores

This paper makes a case for the need of a framework which can be used to measure the functionality delivered by electronic commerce (e-commerce) systems. Such a framework would be helpful in areas such as cost prediction, effort estimatation, and so on. The paper also goes on to propose such a framework, based on the tried and tested methods of function points and object points.peer-reviewe

An enterprise integration project management framework

This paper is actually an adapted M.Sc. proposal. Work on this degree has only just start so there are no results to be presented. However, during the CSAW presentation further details will be given about research problems and how they will be solved.peer-reviewe

Describing and verifying FFT circuits using SharpHDL

Fourier transforms are critical in a variety of fields but in the past, they were rarely used in applications because of the big processing power required. However, the Cooley’s and Tukey’s development of the Fast Fourier Transform (FFT) vastly simplified this. A large number of FFT algorithms have been developed, amongst which are the radix-2 and the radix-22 . These are the ones that have been mostly used for practical applications due to their simple structure with constant butterfly geometry. Most of the research to date for the implementation and benchmarking of FFT algorithms have been performed using general purpose processors, Digital Signal Processors (DSPs) and dedicated FFT processor ICs but as FPGAs have developed they have become a viable solution for computing FFTs. In this paper, SharpHDL, an object oriented HDL, will be used to implement the two mentioned FFT algorithms and test their equivalence.peer-reviewe

Verifying hardware compilers

The use of hardware compilers to generate complex circuits from a high-level description is becoming more and more prevalent in a variety of application areas. However, this introduces further risks as the compilation process may introduce errors in otherwise correct high-level descriptions of circuits. In this paper, we present techniques to enable the automatic verification of hardware compilers through the use of finite-state model checkers. We illustrate the use of these techniques on a simple regular expression hardware compiler and discuss how these techniques can be further developed and used on more complex hardware- description languages.peer-reviewe

Source-level runtime validation through interval temporal logic

The high degree of software complexity achievable through current software development practices makes software more prone to failure. A number of work and work practices has evolved in order to reduce risks related to software correctness and reliability. One of which is validation, which monitors the system execution at runtime and verifies that the system states entered are valid according to the behavioural specification. This paper describes a framework providing an assertion like validation environment for integrating software properties specified in interval temporal logic. The framework consists in three parts. The first part provides a mechanism for converting the human readable assertion to a symbolic automata, which is then used by the second part of the framework that performs the validation.peer-reviewe